The Feature Updating Algorithm for Short Message Content Filtering
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولContent Based Message Filtering System by Using Text Categorization
OSN plays a vital role in day to day life. User can communicate with other user by sharing several types of contents like image, audio and video contents. Major issue in OSN(Online Social Network) is to preventing security in posting unwanted messages. Ability to have a direct control over the messages posted on user wall is not provided. Unwanted post will be directly posted on the public wall...
متن کاملAccelerating Web Content Filtering by the Early Decision Algorithm
Real-time content analysis is typically a bottleneck in Web filtering. To accelerate the filtering process, this work presents a simple, but effective early decision algorithm that analyzes only part of the Web content. This algorithm can make the filtering decision, either to block or to pass the Web content, as soon as it is confident with a high probability that the content really belongs to...
متن کاملShort Data Record Adaptive Filtering: The Auxiliary-Vector Algorithm
Short Data Record Adaptive Filtering: The Auxiliary-Vector Algorithm 1 George N. Karystinos,∗ Haoli Qian,∗ Michael J. Medley,† and Stella N. Batalama∗ ∗Department of Electrical Engineering, State University of New York at Buffalo, 332 Bonner Hall, Buffalo, New York 14260; and †Air Force Research Laboratory, IFGC, 525 Brook Road, Rome, New York 13441 E-mail: [email protected], [email protected]...
متن کاملA parallel algorithm for multi-feature content-based multimedia retrieval
In this paper, we propose a parallel, unified model for the indexing and retrieval by content of multimedia data using a weighted cascade. [4] Each multimedia data type can be viewed as k-dimensional (k-d) data in spatiotemporal domain. [3] Each dimension of the data is separated into small blocks and then formed into a multidimensional tree structure, called a k-tree. Using the ktree structure...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology Journal
سال: 2008
ISSN: 1812-5638
DOI: 10.3923/itj.2008.790.795